منابع مشابه
Graded Posets Zeta Matrix Formula
the finite set of minimal elements is delivered following [1]. This is being achieved via adjacency and zeta matrix description of bipartite digraphs chains the representatives of graded posets. The bipartite digraphs elements of such chains amalgamate to form corresponding cover relation graded poset digraphs with corresponding adjacency matrices being amalgamated throughout natural join as sp...
متن کاملNoncommutative Enumeration in Graded Posets
We define a noncommutative algebra of flag-enumeration functionals on graded posets and show it to be isomorphic to the free associative algebra on countably many generators. Restricted to Eulerian posets, this ring has a particularly appealing presentation with kernel generated by Euler relations. A consequence is that even on Eulerian posets, the algebra is free, with generators corresponding...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کاملSaturated chains in composition posets
We study some poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset N was studied by the author in [5] in relation to non-commutative term orders, and then in [6], where some results about generating functions for standard path...
متن کاملOn Triplet Markov Chains
The restoration of a hidden process X from an observed process Y is often performed in the framework of hidden Markov chains (HMC). HMC have been recently generalized to triplet Markov chains (TMC). In the TMC model one introduces a third random chain U and assumes that the triplet T = (X,U, Y ) is a Markov chain (MC). TMC generalize HMC but still enable the development of efficient Bayesian al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 2017
ISSN: 0167-8094,1572-9273
DOI: 10.1007/s11083-016-9420-1